Lattice reduction

Results: 60



#Item
41Elliptic curve cryptography / Lattice problem / Lattice reduction / Digital signature / RSA / Elliptic curve / Lattice / ICE / Randomized algorithm / Cryptography / Public-key cryptography / Elliptic Curve DSA

“Ooh Aah... Just a Little Bit” : A small amount of side channel can go a long way Naomi Benger1 , Joop van de Pol2 , Nigel P. Smart2 , and Yuval Yarom1 1 School of Computer Science, The University of Adelaide, Austr

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-06-02 03:54:18
42Lattice points / Computational number theory / Linear algebra / Public-key cryptography / Analytic geometry / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / RSA / Algebra / Mathematics / Abstract algebra

Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed]

Add to Reading List

Source URL: www.hpl.hp.com

Language: English - Date: 1999-09-08 19:15:27
43Abstract algebra / Lattice theory / Dimension reduction / Ontology / Self-organizing map / Formal concept analysis / Projection / Competitive learning / Lattice / Mathematics / Neural networks / Mathematical analysis

Combining symbolic and numeric techniques for DL contents classification and analysis Jean-Charles LAMIREL, Yannick TOUSSAINT Abstract The goal of this article is to prove that the mixture of different classification and

Add to Reading List

Source URL: www.ercim.eu

Language: English - Date: 2008-12-08 05:11:33
44Lie groups / Mathematics / Unimodular lattice / Lattice / Smith–Minkowski–Siegel mass formula / E8 lattice / E7 / Orthogonal group / E6 / Abstract algebra / Algebra / Quadratic forms

NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.

Add to Reading List

Source URL: math.stanford.edu

Language: English - Date: 2014-07-08 11:03:33
45NTRU / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / RSA / Polynomial / Cryptography / Post-quantum cryptography / NTRUEncrypt

Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed]

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2011-09-02 16:54:04
46Lie groups / Mathematics / Unimodular lattice / Lattice / Smith–Minkowski–Siegel mass formula / E8 lattice / E7 / Orthogonal group / E6 / Abstract algebra / Algebra / Quadratic forms

NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.

Add to Reading List

Source URL: math.stanford.edu

Language: English - Date: 2014-04-07 08:15:47
47Algebra / Abstract algebra / Lie groups / Euclidean algorithm / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Lattice reduction / Lattice / Hungarian algorithm / Mathematics / Computational number theory / Lattice points

Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2002-01-22 06:23:32
48Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Lattice / Abstract algebra / Symbol / Mathematics

PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2011-09-25 12:09:55
49Lattice points / Abstract algebra / Euclidean algorithm / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Linear algebra / Lattice / Mathematics / Algebra / Computational number theory

(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2011-09-25 12:54:28
50Computational number theory / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Romanization of Malayalam

! " # $ " # %# &%# " " # %#

Add to Reading List

Source URL: www.signelec.com

Language: English - Date: 2010-02-23 06:23:32
UPDATE